Reoptimization in Branch-and-Bound Algorithms with an Application to Elevator Control
نویسندگان
چکیده
We consider reoptimization (i.e., the solution of a problem based on information available from solving a similar problem) for branch-and-bound algorithms and propose a generic framework to construct a reoptimizing branch-and-bound algorithm. We apply this to an elevator scheduling algorithm solving similar subproblems to generate columns using branchand-bound. Our results indicate that reoptimization techniques can substantially reduce the running times of the overall algorithm.
منابع مشابه
An Exact Reoptimization Algorithm for the Scheduling of Elevator Groups
The task of an elevator control is to schedule the elevators of a group such that small waiting and travel times for the passengers are obtained. We present an exact reoptimization algorithm for this problem. A reoptimization algorithm computes a new schedule for the elevator group each time a new passenger arrives. Our algorithm uses column generation techniques and is, to the best of our know...
متن کاملImproving the perfomance of elevator systems using exact reoptimization algorithms
The task of an elevator control is to schedule the elevators of a group such that small average and maximal waiting and travel times for the passengers are obtained. We present a novel exact reoptimization algorithm for this problem. A reoptimization algorithm computes a new optimal schedule for the elevator group each time a new passenger arrives. Our algorithm uses column generation technique...
متن کاملOnline-optimization of multi-elevator transport systems with reoptimization algorithms based on set-partitioning models
We develop and experimentally compare policies for the control of a system of k elevators with capacity one in a transport environment with I floors, an idealized version of a pallet elevator system in a large distribution center of the Herlitz P B S A G in Falkensee. Each elevator in the idealized system has an individual waiting queue of infinite capacity. On each floor, requests arrive over ...
متن کاملReoptimization Techniques in MIP Solvers
Recently, there have been many successful applications of optimization algorithms that solve a sequence of quite similar mixed-integer programs (MIPs) as subproblems. Traditionally, each problem in the sequence is solved from scratch. In this paper we consider reoptimization techniques that try to benefit from information obtained by solving previous problems of the sequence. We focus on the ca...
متن کامل